Bipartite Divisor Graphs for Integer Subsets
نویسندگان
چکیده
منابع مشابه
On bipartite zero-divisor graphs
A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...
متن کاملBipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f( ( n 2 ) + m) = b 2 4 c + min(d n 2 e, f(m)). This supplies the precise value of f(p) for many values of p including, e.g, all p = ( n 2 ) + ( m 2 ) when n is large enough and m 2 4 ≤ n 2 .
متن کاملMixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ;E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mixed-integer set: X(G, b, I) = {x : Ax ≥ b, x ≥ 0, xi integer for all i ∈ I}. We characterize conv(X(G, b, I)) in its original space. That is, we describe a matrix (A′, b′) such that conv(X(G, b, I)) = {x : A′x ≥ b′}. Th...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2010
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-010-0897-x